Mutual information-based context quantization
نویسندگان
چکیده
منابع مشابه
Mutual information-based context quantization
Context-based lossless coding suffers in many cases from the so-called context dilution problem, which arises when, in order to model high-order statistic dependencies among data, a large number of contexts is used. In this case the learning process cannot be fed with enough data, and so the probability estimation is not reliable. To avoid this problem, state-of-the-art algorithms for lossless ...
متن کاملOn Classification of Bivariate Distributions Based on Mutual Information
Among all measures of independence between random variables, mutual information is the only one that is based on information theory. Mutual information takes into account of all kinds of dependencies between variables, i.e., both the linear and non-linear dependencies. In this paper we have classified some well-known bivariate distributions into two classes of distributions based on their mutua...
متن کاملMultimodal Registration via Spatial-Context Mutual Information
We propose a method to efficiently compute mutual information between high-dimensional distributions of image patches. This in turn is used to perform accurate registration of images captured under different modalities, while exploiting their local structure otherwise missed in traditional mutual information definition. We achieve this by organizing the space of image patches into orbits under ...
متن کاملMin-Sum Algorithm with Maximum Average Mutual Information Quantization
The specific methods of the maximum average mutual information quantization are analyzed and deduced. With this method to quantify the initial message, the variable messages and check messages are converted into integers. Then the min-sum decoding algorithm based on integer arithmetic is implemented. Simulation results demonstrate that the decoding performance of min-sum algorithm based on inte...
متن کاملMutual information rate, distortion, and quantization in metric spaces
A&mct-Several new properties as well as simplified proofs of known propertks are developed for the mutual information rate between disaetetlme random processa whosedphabeQ~Borelsubse*lOf complete sepamble met& speces. In particulpr, the apymptotic properties of quantizers for such spaces provide a link with finitMlphabet processes and yield the ergodic decomposition of mutual information rate. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Signal Processing: Image Communication
سال: 2010
ISSN: 0923-5965
DOI: 10.1016/j.image.2009.09.002